Relative Liveness From Intuition to Automated Veri cation
نویسندگان
چکیده
We point out de ciencies of previous treatments of liveness We de ne a new liveness condition in two forms one based on nite trace theory and the other on automata We prove the equivalence of these two de nitions We also intro duce a safety condition and provide modular and hierarchical veri cation theorems for both safety and liveness Finally we present a veri cation algorithm for liveness Index terms Concurrent systems deadlock fairness nite automata liveness safety trace structures veri cation
منابع مشابه
Veri cation of a Production Cell using an Automatic Veri cation Environment for VHDL
This paper presents from the users point of view the automatic veri cation of nontrivial liveness properties for a reactive system implemented using VHDL. The aim is to make clear the simplicity, power and practical relevance of tools developed within the ESPRIT project FORMAT. For the specialist this paper provides a run through Assumption Commitment Style Veri cation and an overview of releva...
متن کاملUsing a Veri cation System to Reason about Post-Completion Errors
Faults in the way a system works are often attributed to user error. Formal veri cation is one approach advocated to help avoid errors. Previous work has concentrated on ensuring that implementations meet speci cations or that safety or liveness properties hold of a speci cation. However, systems veri ed in this way are still prone to catastrophic user errors. The designs of computer systems ca...
متن کاملRelative liveness: from intuition to automated verification
We point out deeciencies of previous treatments of liveness. We deene a new liveness condition in two forms: one based on nite trace theory, and the other on automata. We prove the equivalence of these two deenitions. We also introduce a safety condition and provide modular and hierarchical veriication theorems for both safety and liveness. Finally, we present a veriication algorithm for liveness.
متن کاملAutomatic Symbolic Veri cation of Embedded Systems
We present a model-checking procedure and its implementation for the automatic veri cation of embedded systems. The system components are described as Hybrid Automata|communicating machines with nite control and real-valued variables that represent continuous environment parameters such as time, pressure, and temperature. The system requirements are speci ed in a temporal logic with stop watche...
متن کاملLiveness in Timed and Untimed Systems
When proving the correctness of algorithms in distributed systems, one generally considers safety conditions and liveness conditions. The Input/Output (I/O) automaton model and its timed version have been used successfully, but have focused on safety conditions and on a restricted form of liveness called fairness. In this paper we develop a new I/O automaton model, and a new timed I/O automaton...
متن کامل